TSTP Solution File: SEV433^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEV433^1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 17:36:42 EDT 2022
% Result : Theorem 0.18s 0.39s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 29 unt; 4 typ; 0 def)
% Number of atoms : 227 ( 131 equ; 0 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 158 ( 66 ~; 48 |; 4 &; 38 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 ^ 48 !; 0 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_f,type,
f: $i > $o ).
thf(tp_sK1_X,type,
sK1_X: $i ).
thf(tp_sK2_SY5,type,
sK2_SY5: $i ).
thf(tp_sK3_SY7,type,
sK3_SY7: $i ).
thf(1,axiom,
! [X: $i,Y: $i] :
( ( ( f @ X )
= ( f @ Y ) )
=> ( X = Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finj) ).
thf(2,conjecture,
! [X: $i,Y: $i,Z: $i] :
( ( X = Y )
| ( X = Z )
| ( Y = Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3) ).
thf(3,negated_conjecture,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( X = Y )
| ( X = Z )
| ( Y = Z ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[2]) ).
thf(4,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( X = Y )
| ( X = Z )
| ( Y = Z ) ) )
= $false ),
inference(unfold_def,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [X: $i,Y: $i] :
( ( ( f @ X )
= ( f @ Y ) )
=> ( X = Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(6,plain,
( ( ! [SY5: $i,SY6: $i] :
( ( sK1_X = SY5 )
| ( sK1_X = SY6 )
| ( SY5 = SY6 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(7,plain,
( ( ! [SY7: $i] :
( ( sK1_X = sK2_SY5 )
| ( sK1_X = SY7 )
| ( sK2_SY5 = SY7 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[6]) ).
thf(8,plain,
( ( ( sK1_X = sK2_SY5 )
| ( sK1_X = sK3_SY7 )
| ( sK2_SY5 = sK3_SY7 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[7]) ).
thf(9,plain,
( ( ~ ( ( sK1_X = sK2_SY5 )
| ( sK1_X = sK3_SY7 )
| ( sK2_SY5 = sK3_SY7 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(10,plain,
( ( ( sK2_SY5 != sK3_SY7 )
& ( sK1_X != sK2_SY5 )
& ( sK1_X != sK3_SY7 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(11,plain,
( ( ! [X: $i,Y: $i] :
( ( ( f @ X )
!= ( f @ Y ) )
| ( X = Y ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(12,plain,
( ( ! [X: $i,Y: $i] :
( ( ( f @ X )
!= ( f @ Y ) )
| ( X = Y ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(13,plain,
( ( ( sK2_SY5 != sK3_SY7 )
& ( sK1_X != sK2_SY5 )
& ( sK1_X != sK3_SY7 ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(14,plain,
( ( ~ ( ~ ( ( sK2_SY5 != sK3_SY7 ) )
| ~ ~ ( ~ ( ( sK1_X != sK2_SY5 ) )
| ~ ( ( sK1_X != sK3_SY7 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(15,plain,
! [SV1: $i] :
( ( ! [SY8: $i] :
( ( ( f @ SV1 )
!= ( f @ SY8 ) )
| ( SV1 = SY8 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(16,plain,
( ( ~ ( ( sK2_SY5 != sK3_SY7 ) )
| ~ ~ ( ~ ( ( sK1_X != sK2_SY5 ) )
| ~ ( ( sK1_X != sK3_SY7 ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(17,plain,
! [SV2: $i,SV1: $i] :
( ( ( ( f @ SV1 )
!= ( f @ SV2 ) )
| ( SV1 = SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(18,plain,
( ( ~ ( ( sK2_SY5 != sK3_SY7 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(19,plain,
( ( ~ ~ ( ~ ( ( sK1_X != sK2_SY5 ) )
| ~ ( ( sK1_X != sK3_SY7 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(20,plain,
! [SV2: $i,SV1: $i] :
( ( ( ( ( f @ SV1 )
!= ( f @ SV2 ) ) )
= $true )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[17]) ).
thf(21,plain,
( ( ( sK2_SY5 != sK3_SY7 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(22,plain,
( ( ~ ( ~ ( ( sK1_X != sK2_SY5 ) )
| ~ ( ( sK1_X != sK3_SY7 ) ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[19]) ).
thf(23,plain,
! [SV2: $i,SV1: $i] :
( ( ( ( f @ SV1 )
= ( f @ SV2 ) )
= $false )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(24,plain,
( ( sK2_SY5 = sK3_SY7 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(25,plain,
( ( ~ ( ( sK1_X != sK2_SY5 ) )
| ~ ( ( sK1_X != sK3_SY7 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(26,plain,
! [SV2: $i,SV1: $i] :
( ( ( ~ ( ( f @ SV1 )
| ( f @ SV2 ) )
| ~ ( ~ ( f @ SV1 )
| ~ ( f @ SV2 ) ) )
= $false )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_equal_neg,[status(thm)],[23]) ).
thf(27,plain,
! [SV2: $i,SV1: $i] :
( ( ( ( f @ SV1 )
= ( f @ SV2 ) )
= $false )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_equal_neg,[status(thm)],[23]) ).
thf(28,plain,
( ( ~ ( ( sK1_X != sK2_SY5 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[25]) ).
thf(29,plain,
( ( ~ ( ( sK1_X != sK3_SY7 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[25]) ).
thf(30,plain,
! [SV2: $i,SV1: $i] :
( ( ( ~ ( ( f @ SV1 )
| ( f @ SV2 ) ) )
= $false )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[26]) ).
thf(31,plain,
! [SV2: $i,SV1: $i] :
( ( ( ~ ( ~ ( f @ SV1 )
| ~ ( f @ SV2 ) ) )
= $false )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[26]) ).
thf(32,plain,
( ( ( sK1_X != sK2_SY5 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[28]) ).
thf(33,plain,
( ( ( sK1_X != sK3_SY7 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[29]) ).
thf(34,plain,
! [SV2: $i,SV1: $i] :
( ( ( ( f @ SV1 )
| ( f @ SV2 ) )
= $true )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[30]) ).
thf(35,plain,
! [SV2: $i,SV1: $i] :
( ( ( ~ ( f @ SV1 )
| ~ ( f @ SV2 ) )
= $true )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[31]) ).
thf(36,plain,
( ( sK1_X = sK2_SY5 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[32]) ).
thf(37,plain,
( ( sK1_X = sK3_SY7 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[33]) ).
thf(38,plain,
! [SV2: $i,SV1: $i] :
( ( ( f @ SV1 )
= $true )
| ( ( f @ SV2 )
= $true )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[34]) ).
thf(39,plain,
! [SV2: $i,SV1: $i] :
( ( ( ~ ( f @ SV1 ) )
= $true )
| ( ( ~ ( f @ SV2 ) )
= $true )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[35]) ).
thf(40,plain,
! [SV2: $i,SV1: $i] :
( ( ( f @ SV1 )
= $false )
| ( ( ~ ( f @ SV2 ) )
= $true )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(41,plain,
! [SV1: $i,SV2: $i] :
( ( ( f @ SV2 )
= $false )
| ( ( f @ SV1 )
= $false )
| ( ( SV1 = SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(42,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[24,41,38,37,36,27]) ).
thf(43,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEV433^1 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 28 15:34:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.33
% 0.12/0.33 No.of.Axioms: 1
% 0.12/0.33
% 0.12/0.33 Length.of.Defs: 0
% 0.12/0.33
% 0.12/0.33 Contains.Choice.Funs: false
% 0.12/0.34 (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:3,loop_count:0,foatp_calls:0,translation:fof_full)
% 0.18/0.39 ********************************
% 0.18/0.39 * All subproblems solved! *
% 0.18/0.39 ********************************
% 0.18/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:42,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.18/0.39
% 0.18/0.39 %**** Beginning of derivation protocol ****
% 0.18/0.39 % SZS output start CNFRefutation
% See solution above
% 0.18/0.39
% 0.18/0.39 %**** End of derivation protocol ****
% 0.18/0.39 %**** no. of clauses in derivation: 43 ****
% 0.18/0.39 %**** clause counter: 42 ****
% 0.18/0.39
% 0.18/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:42,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------